Universit a Di Pisa Making Abstract Interpretations Complete Making Abstract Interpretations Complete
نویسنده
چکیده
Completeness in abstract interpretation is an ideal situation where the abstract semantics is able to take full advantage of the power of representation of the underlying abstract domain. Thus, complete abstract interpretations can be rightfully considered as optimal. In this article , we develop a general theory of completeness in abstract interpretation, also dealing with the most frequent case of least xpoint semantics. We show that both completeness and least xpoint completeness are properties that only depend on the underlying abstract domain. In this context, we demonstrate that there always exist both the greatest complete and least xpoint complete restrictions of any abstract domain, and for continuous semantic functions, the least complete extension exists as well. Also, under certain hypotheses, a constructive characterization of the least complete extensions and restrictions of abstract domains is given as solutions of simple abstract domain equations. These methodologies provide advanced algebraic tools for manipulating and comparing abstract interpretations, which can be fruitfully used both in program analysis and in semantics design. A number of examples illustrating these techniques are given in the elds of integer variable and logic program analysis.
منابع مشابه
Universit a Di Pisa Functional Compositions of Abstract Interpretations Functional Compositions of Abstract Interpretations
In the context of standard abstract interpretation theory, we deene and study a systematic operator of reduced relative power for composing functionally abstract domains. The reduced relative power of two abstract domains D1 (the exponent) and D2 (the base) consists in a suitably deened lattice of monotone functions from D1 to D2, called dependencies, and it is a generalization of the Cousot an...
متن کاملUniversit a Di Pisa Using Mpi for P3l Implementation Universit a Degli Studi Di Pisa Dipartimento Di Informatica Using Mpi for P3l Implementation
This document concerns with the implementation of the P3L parallel programming language on the MPI abstract Machine. First we focus our attention on the characteristics of the MPI Abstract Machine, then we present a preliminary implementaton for each P3L construct based on that architecture.
متن کاملTransforming Abstract Interpretations by Abstract Interpretation New Challenges in Language-based Security
In this paper we exploit abstract interpretation for transforming abstract domains and semantics. The driving force in both transformations is making domains and semantics, i.e. abstract interpretations themselves, complete, namely precise, for some given observation. We prove that a common geometric pattern is shared by all these transformations, both at the domain and semantic level. This pat...
متن کاملUniversit a Di Pisa Logical Formalizations of Syntactical Properties (extended Abstract) Logical Formalizations of Syntactical Properties (extended Abstract)
متن کامل
Complete Abstract Interpretations Made Constructive
Completeness is a desirable, although uncommon, property of abstract interpretations, formalizing the intuition that, relatively to the underlying abstract domains, the abstract semantics is as precise as possible. We consider here the most general form of completeness, where concrete semantic functions can have different domains and ranges, a case particularly relevant in functional programmin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997